Blind Counter Automata on ω-Words
نویسندگان
چکیده
This paper generalizes the concept of blind multicounter languages to infinite words. We introduce two different acceptance modes of blind multicounter machines on ω-words, called synchrononous and asynchronous acceptance. These acceptance modes are compared with each other and with families of ω-languages of the form L = ⋃ 1≤i≤k UiV ω i , where Ui, Vi are finitary blind multicounter languages.
منابع مشابه
An Effective Extension of the Wagner Hierarchy to Blind Counter Automata
The extension of the Wagner hierarchy to blind counter automata accepting infinite words with a Muller acceptance condition is effective. We determine precisely this hierarchy.
متن کاملThe Wadge Hierarchy of Petri Nets ω-Languages
We describe the Wadge hierarchy of the ω-languages recognized by deterministic Petri nets. This is an extension of the celebrated Wagner hierarchy which turned out to be the Wadge hierarchy of the ω-regular languages. Petri nets are more powerful devices than finite automata. They may be defined as partially blind multi-counter automata. We show that the whole hierarchy has height ω 2 , and giv...
متن کاملOn the Topological Complexity of omega-Languages of Non-Deterministic Petri Nets
We show that there are Σ 3 -complete languages of infinite words accepted by non-deterministic Petri nets with Büchi acceptance condition, or equivalently by Büchi blind counter automata. This shows that ω-languages accepted by non-deterministic Petri nets are topologically more complex than those accepted by deterministic Petri nets.
متن کاملOn the topological complexity of ω-languages of non-deterministic Petri nets
We show that there are Σ3-complete languages of infinite words accepted by non-deterministic Petri nets with Büchi acceptance condition, or equivalently by Büchi blind counter automata. This shows that ω-languages accepted by non-deterministic Petri nets are topologically more complex than those accepted by deterministic Petri nets.
متن کاملBüchi VASS recognise w-languages that are Sigma^1_1 - complete
This short note exhibits an example of a Σ1-complete language that can be recognised by a one blind counter Büchi automaton (or equivalently a Büchi VASS with only one place). In this work we study the topological complexity of ω-languages recognised by vector addition systems with states equipped with Büchi acceptance condition (Büchi VASS). This model corresponds, from the automata theoretic ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007